To deal with the problems that message-distributed tasks are backlogged by nodes in the inner community and active nodes are blindly selected to transmit message in the Community-based Message Transmission Scheme in Opportunistic Social Network (OSNCMTS), a High-Efficient Community-based Message Transmission Scheme in opportunistic network (HECMTS) was proposed. In HECMTS, firstly, communities were divided by Extremal Optimization (EO) algorithm and the corresponding community matrices were distributed to nodes; secondly, the copies of message were assigned based on the community matrices and the success rate of data packets to destination nodes; finally, the active nodes' information was collected by the opportunities of active nodes' back and forth in different communities, then the suitable nodes were selected to finish message transmitting between communities by querying the active node information. The simulation results show that routing overhead in HECMTS is decreased by at least 19% and the average end-to-end delay is decreased by at least 16% compared with OSNCMTS.